package com.leetcode.merci.lc540;

/**
 * Created by bowen on 2017/7/24.
 */
public class Solution {
    public int singleNonDuplicate(int[] nums) {
        int result = 0 ;
        for(int i=0;i<nums.length;i++){
            result^=nums[i];
        }
        return result;
    }
}